In this paper, we propose a variant of stable model semantics for disjunctivelogic programming and deductive databases. The semantics, called minimalfounded, generalizes stable model semantics for normal (i.e. non disjunctive)programs but differs from disjunctive stable model semantics (the extension ofstable model semantics for disjunctive programs). Compared with disjunctivestable model semantics, minimal founded semantics seems to be more intuitive,it gives meaning to programs which are meaningless under stable model semanticsand is no harder to compute. More specifically, minimal founded semanticsdiffers from stable model semantics only for disjunctive programs havingconstraint rules or rules working as constraints. We study the expressive powerof the semantics and show that for general disjunctive datalog programs it hasthe same power as disjunctive stable model semantics.
展开▼
